#include <stdio.h>
#include <math.h>

int prime(int p);
void Goldbach(int n);

int main()
{
    int m, n, i, cnt;

    scanf("%d %d", &m, &n);
    if (prime(m) != 0)
        printf("%d is a prime number\n", m);
    if (m < 6)
        m = 6;
    if (m % 2)
        m++;
    cnt = 0;
    for (i = m; i <= n; i += 2)
    {
        Goldbach(i);
        cnt++;
        if (cnt % 5)
            printf(", ");
        else
            printf("\n");
    }

    return 0;
}

/* 你的代码将被嵌在这里 */
int prime(int p)
{
    if (p <= 1)
        return 0;
    if (p <= 3)
        return 1;
    if (p % 2 == 0)
        return 0;
    for (int i = 3; i * i <= p; i += 2)
    {
        if (p % i == 0)
            return 0;
    }
    return 1;
}

void Goldbach(int n)
{
    for (int number = 2; number <= n / 2; number++)
    {
        if (prime(number) == 1 && prime(n - number))
        {
            printf("%d=%d+%d", n, number, n - number);
            break;
        }
    }
}